Stochastic analysis of real-time systems under preemptive priority-driven scheduling
نویسندگان
چکیده
منابع مشابه
Schedulability Analysis of Real-time Systems under Dual-priority Scheduling
This paper presents schedulability analysis which has been developed in order to precisely estimate task response times, taking into account kernel execution effects. The analysis takes into consideration specific features of the HARTEX hard real-time kernel, and in particular: asynchronous event-driven operation; integrated scheduling of hard and soft real-time tasks (as well as tasks and reso...
متن کاملCache and Pipeline Sensitive Fixed Priority Scheduling for Preemptive Real-Time Systems
Current schedulability analyses for preemptive systems consider cache behaviour by adding preemption caused cache reload costs. Thereby, they ignore the fact that delays due to cache misses often have a reduced impact because of pipeline effects. In this paper, these methods are called isolated. Pipeline-related preemption costs are not considered at all in current schedulability analyses. This...
متن کاملAnalyzing Stochastic Fixed-Priority Real-Time Systems
Traditionally, real-time systems require that the deadlines of all jobs be met. For many applications, however, this is an overly stringent requirement. An occasional missed deadline may cause decreased performance but is nevertheless acceptable. We present an analysis technique by which a lower bound on the percentage of deadlines that a periodic task meets is determined and compare the lower ...
متن کاملDelay Analysis for Real-time and Non Real-time Traffic Streams under a Priority Cell Scheduling
In this paper, we consider a priority cell scheduling in the following scenario. High-speed cell networks accommodate Constant Bit Rate (CBR) streams from real-time sources and Unspecified Bit Rate (UBR) streams from non real-time sources. The realtime traffic requires guarantees of its delay time. On the other hand, the non real-time traffic is relatively tolerable to its delay time. We obtain...
متن کاملNon-preemptive real-time scheduling of dataflow systems
Real-time signal processing applications can be described naturally with dataflow graphs. The systems we consider have a mix of real-time and non-real-time processing, where independent dataflow graphs represent tasks and individual dataflow actors are subtasks. Rate-monotonic scheduling is optimal for fixed-priority, preemptive scheduling of periodic tasks. Priority inheritance protocols exten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Real-Time Systems
سال: 2008
ISSN: 0922-6443,1573-1383
DOI: 10.1007/s11241-008-9053-6